Containment for queries over trees with attribute value comparisons
نویسندگان
چکیده
منابع مشابه
Containment for Tree Patterns with Attribute Value Comparisons
Tree patterns (TP) is a simple and widely used fragment of XPath. The problem of containment in TP has been extensively studied previously. It was shown that the containment problem ranges from PTime to PSpace depending on the available constructs. In this paper we study the complexity of the containment problem for tree patterns with attribute value comparisons. We show that the complexity ran...
متن کاملOn Containment of Conjunctive Queries with Arithmetic Comparisons
We study the following problem: how to test if Q2 is contained in Q1, where Q1 and Q2 are conjunctive queries with arithmetic comparisons? This problem is fundamental in a large variety of database applications. Existing algorithms rst normalize the queries, then test a logical implication using multiple containment mappings from Q1 to Q2. We are interested in cases where the containment can be...
متن کاملConjunctive Query Containment over Trees
The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child , NextSibling , their transitive and reflexive closures, and Following . For the containment problem a trichotomy is presented, classifying the problems as in PTIME, coNP-complete, or Π 2 -complete. For the satisfiability problem most problems ar...
متن کاملContainment of Conjunctive Queries over Conceptual Schemata
Conceptual Modelling plays a fundamental role in database design since Chen’s Entity-Relationship (ER) model. In this paper we consider a conceptual model capable of capturing classes of objects with their attributes, relationships among classes, cardinality constraints in the participation of entities to relationships, and is-a relations among both classes and relationships. We provide a forma...
متن کاملContainment of Conjunctive Queries over Databases with Null Values
We study containment of conjunctive queries that are evaluated over databases that may contain tuples with null values. We assume the semantics of SQL for single block queries with a SELECT DISTINCT clause. This problem (“null containment” for short) is different from containment over databases without null values and sometimes more dif-
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 2016
ISSN: 0306-4379
DOI: 10.1016/j.is.2015.11.003